The Unconstrained Binary Quadratic Programming for the Sum Coloring Problem
نویسندگان
چکیده
منابع مشابه
Solving the minimum sum coloring problem via binary quadratic programming
In recent years, binary quadratic programming (BQP) has been 7 successively applied to solve several combinatorial optimization problems. We 8 consider in this paper a study of using the BQP model to solve the minimum 9 sum coloring problem (MSCP). For this purpose, we recast the MSCP with 10 a quadratic model which is then solved via a recently proposed Path Relink11 ing (PR) algorithm designe...
متن کاملAn Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods have been proposed for this difficult class of problems. Recent successes in the use of the unconstrained quadratic programming (UQP) model as a unified framework for modeling and solving combinatorial optimization proble...
متن کاملThe unconstrained binary quadratic programming problem: a survey
In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the field of combinatorial optimization due to its application potential and its computational challenge. Research on UBQP has generated a wide range of solution techniques for this basic model that encompasses a rich collection of problem types. In this paperwe survey the literature on this importantmo...
متن کاملPath relinking for unconstrained binary quadratic programming
This paper presents two path relinking algorithms to solve the unconstrained binary quadratic programming (UBQP) problem. One is based on a greedy strategy to generate the relinking path from the initial solution to the guiding solution and the other operates in a random way. We show extensive computational results on five sets of benchmarks, including 31 large random UBQP instances and 103 str...
متن کاملNeighborhood Combination for Unconstrained Binary Quadratic Programming
Using the Unconstrained Binary Quadratic Programming (UBQP) problem as a case study, we present an experimental analysis of neighborhood combinations for local search based metaheuristic algorithms. In this work, we use one-flip and two-flip moves and investigate combined neighborhoods with these two moves within two metaheuristic algorithms. The goal of the analysis is to help understand why a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modern Applied Science
سال: 2012
ISSN: 1913-1852,1913-1844
DOI: 10.5539/mas.v6n9p26